A Clustering K-Anonymity Scheme for Location Privacy Preservation

نویسندگان

  • Lin Yao
  • Guowei Wu
  • Jia Wang
  • Feng Xia
  • Chi Lin
  • Guojun Wang
چکیده

The continuous advances in sensing and positioning technologies have resulted in a dramatic increase in popularity of LocationBased Services (LBS). Nevertheless, the LBS can lead to user privacy breach due to sharing location information with potentially malicious services. A high degree of location privacy preservation for LBS is extremely required. In this paper, a clustering K-anonymity scheme for location privacy preservation (namely CK) is proposed. The CK scheme does not rely on a trusted third party to anonymize the location information of users. In CK scheme, the whole area that all the users reside is divided into clusters recursively in order to get cloaked area. The exact location information of the user is replaced by the cloaked spatial temporal boundary (STB) including K users. The user can adjust the resolution of location information with spatial or temporal constraints to meet his personalized privacy requirement. The experimental results show that CK can provide stringent privacy guarantees, strong robustness and high QoS (Quality of Service). key words: K-anonymity, spatial-temporal constraints, location-based services, location privacy, clustering

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A k -Anonymity Clustering Method for Effective Data Privacy Preservation

Data privacy preservation has drawn considerable interests in data mining research recently. The k-anonymity model is a simple and practical approach for data privacy preservation. This paper proposes a novel clustering method for conducting the k-anonymity model effectively. In the proposed clustering method, feature weights are automatically adjusted so that the information distortion can be ...

متن کامل

A novel local search method for microaggregation

In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...

متن کامل

Gain Ratio Based Feature Selection Method for Privacy Preservation

Privacy-preservation is a step in data mining that tries to safeguard sensitive information from unsanctioned disclosure and hence protecting individual data records and their privacy. There are various privacy preservation techniques like k-anonymity, l-diversity and t-closeness and data perturbation. In this paper k-anonymity privacy protection technique is applied to high dimensional dataset...

متن کامل

An Effective Scheme for Location Privacy in VANETs

Location privacy is an important concern in VANETs(Vehicular Ad hoc Networks). Anonymity is one of commonly adopted solution to protect location privacy. In this paper, we present a mechanism based on an ID-based cryptosystem in order to ensure vehicles’ anonymity by pseudonyms. In this mechanism, we adopt Pseudonyms Synchronously Change ( PSC ) scheme, which improves anonymity. In the schemes,...

متن کامل

Research on Privacy Preserving on K-anonymity

The disclosure of sensitive information has become prominent nowadays; privacy preservation has become a research hotspot in the field of data security. Among all the algorithms of privacy preservation in data mining, K-anonymity is a kind of common and valid algorithm in privacy preservation, which can effectively prevent the loss of sensitive information under linking attacks, and it is widel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 95-D  شماره 

صفحات  -

تاریخ انتشار 2012